The complexity of connected dominating sets and total dominating sets with specified induced subgraphs
نویسندگان
چکیده
Given a graph class G, it is natural to ask (i) whether a given graph G has a connected or a total dominating set whose induced subgraph is a member of G and (ii) whether G has such a set of cardinality at most a given threshold. We give sufficient conditions on G under which these two problems are NP-hard. This condition is fulfilled in a wide variety of classes of graphs.
منابع مشابه
TOTAL DOMINATION POLYNOMIAL OF GRAPHS FROM PRIMARY SUBGRAPHS
Let $G = (V, E)$ be a simple graph of order $n$. The total dominating set is a subset $D$ of $V$ that every vertex of $V$ is adjacent to some vertices of $D$. The total domination number of $G$ is equal to minimum cardinality of total dominating set in $G$ and denoted by $gamma_t(G)$. The total domination polynomial of $G$ is the polynomial $D_t(G,x)=sum d_t(G,i)$, where $d_t(G,i)$ is the numbe...
متن کاملOn the edge geodetic and edge geodetic domination numbers of a graph
In this paper, we study both concepts of geodetic dominatingand edge geodetic dominating sets and derive some tight upper bounds onthe edge geodetic and the edge geodetic domination numbers. We also obtainattainable upper bounds on the maximum number of elements in a partitionof a vertex set of a connected graph into geodetic sets, edge geodetic sets,geodetic domin...
متن کاملOn dominating sets whose induced subgraphs have a bounded diameter
We study dominating sets whose induced subgraphs have a bounded diameter. Such sets were used in recent papers by Kim et al. and Yu et al. to model virtual backbones in wireless networks where the number of hops required to forward messages within the backbone is minimized. We prove that for any fixed k ≥ 1 it is NP-complete to decide whether a given graph admits a dominating set whose induced ...
متن کاملStrength of strongest dominating sets in fuzzy graphs
A set S of vertices in a graph G=(V,E) is a dominating set ofG if every vertex of V-S is adjacent to some vertex of S.For an integer k≥1, a set S of vertices is a k-step dominating set if any vertex of $G$ is at distance k from somevertex of S. In this paper, using membership values of vertices and edges in fuzzy graphs, we introduce the concepts of strength of strongestdominating set as well a...
متن کاملOn graphs with equal total domination and connected domination numbers
A subset S of V is called a total dominating set if every vertex in V is adjacent to some vertex in S. The total domination number γt (G) of G is the minimum cardinality taken over all total dominating sets of G. A dominating set is called a connected dominating set if the induced subgraph 〈S〉 is connected. The connected domination number γc(G) of G is the minimum cardinality taken over all min...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 112 شماره
صفحات -
تاریخ انتشار 2012